Achievable Rates for K-user Gaussian Interference Channels
نویسندگان
چکیده
The aim of this paper is to study the achievable rates for a K user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel (G-IFC) into a discrete input-output noiseless channel, and subsequently algebraic codes are developed to achieve good rates over this new alphabet. In this context, a quantity called efficiency is introduced which reflects the effectiveness of the algebraic coding strategy. The paper first addresses the problem of finding high efficiency algebraic codes. A combination of these codes with Construction-A lattices is then used to achieve non trivial rates for the original Gaussian interference channel.
منابع مشابه
The Expected Achievable Distortion of Two-User Decentralized Interference Channels
This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state information at receivers (CSIR) is considered in two scenarios of perfect and imperfect CSIR. In the imperfect CSIR case, we consider a more practical assumption of...
متن کاملAsymmetric Transmitter Cooperation in Multiuser Wireless Networks: Achievable Rate Regions
In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of message sharing between the transmitters. We introduce two natural ways of extending the concept of unidirectional message sharing from two users to three users (i...
متن کاملSum Capacity of Degraded Gaussian Interference Networks
This paper determines the sum-capacity of degraded Gaussian K-user interference channels (IFCs). To this end, the paper first develops a family of genie-MAC (multiple access channel) outer bounds for Gaussian K-user interference channels. This family is based on existing genie-aided bounding mechanisms, but differs from current approaches in its optimization problem formulation and application....
متن کاملAchievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملThe Approximate Capacity Region of the Phase-Fading, Very Strong, K-User Gaussian Interference Channel
Consider the K-user Gaussian interference channel with static channel coefficients. Recent efforts have characterized the capacity region to within a constant gap for several important special cases, including two-user, very weak, many-to-one, and one-to-many interference channels. The general case remains open, primarily due to the challenge of characterizing the achievable rate for interferen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 58 شماره
صفحات -
تاریخ انتشار 2012